Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes

نویسنده

  • Max A. Alekseyev
چکیده

Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions, fissions, and translocations, 3-break rearrangements represent a natural generalization of transpositions. Alekseyev and Pevzner (2007a, 2008a) studied multi-break rearrangements in circular genomes and further applied them to the analysis of chromosomal evolution in mammalian genomes. In this paper, we extend these results to the more difficult case of linear genomes. In particular, we give lower bounds for the rearrangement distance between linear genomes and for the breakpoint re-use rate as functions of the number and proportion of transpositions. We further use these results to analyze comparative genomic architecture of mammalian genomes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-break Rearrangements: From Circular to Linear Genomes

Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2break rearrangements represent standard reversals, fusions, fissions, and translocations operations; 3-break rearrangements are a natural generalization of transpositions and inverted transpositions. Multi-break rearrangements in circular genomes were studied in depth in [1] a...

متن کامل

Generalized Hultman Numbers and Cycle Structures of Breakpoint Graphs

Genome rearrangements can be modeled as k-breaks, which break a genome at k positions and glue the resulting fragments in a new order. In particular, reversals, translocations, fusions, and fissions are modeled as 2-breaks, and transpositions are modeled as 3-breaks. Although k-break rearrangements for [Formula: see text] have not been observed in evolution, they are used in cancer genomics to ...

متن کامل

A linear time algorithm for the inversion median problem in circular bacterial genomes

In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum ∑ 3 i=1 d(G,Gi) is minimized. The median problem is a special case of the multiple genome rearrangement problem, where one wants to find a phylogenetic tree describing the most “plausible” rearrangement scenario for multiple species...

متن کامل

Efficient sorting of genomic permutations by translocation, inversion and block interchange

MOTIVATION Finding genomic distance based on gene order is a classic problem in genome rearrangements. Efficient exact algorithms for genomic distances based on inversions and/or translocations have been found but are complicated by special cases, rare in simulations and empirical data. We seek a universal operation underlying a more inclusive set of evolutionary operations and yielding a tract...

متن کامل

The Median Problem for the Reversal Distance in Circular Bacterial Genomes

In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum ∑3 i=1 d(G,Gi) is minimized. The median problem is a special case of the multiple genome rearrangement problem, where one wants to find a phylogenetic tree describing the most “plausible” rearrangement scenario for multiple species....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of computational biology : a journal of computational molecular cell biology

دوره 15 8  شماره 

صفحات  -

تاریخ انتشار 2008